Sublinear Distance Variance
نویسندگان
چکیده
Let 0 < a < b < ∞, and for each edge e of Zd let ωe = a or ωe = b, each with probability 1/2, independently. This induces a random metric distω on the vertices of Z d, called first passage percolation. We prove that for d > 1 the distance distω(0, v) from the origin to a vertex v, |v| > 2, has variance bounded by C |v|/ log |v|, where C = C(a, b, d) is a constant which may only depend on a, b and d. Some related variants are also discussed.
منابع مشابه
First Passage Percolation Has Sublinear Distance Variance
Let 0 < a < b < ∞, and for each edge e of Zd let ωe = a or ωe = b, each with probability 1/2, independently. This induces a random metric distω on the vertices of Z d, called first passage percolation. We prove that for d > 1 the distance distω(0, v) from the origin to a vertex v, |v| > 2, has variance bounded by C |v|/ log |v|, where C = C(a, b, d) is a constant which may only depend on a, b a...
متن کاملSublinear variance for directed last-passage percolation
A range of first-passage percolation type models are believed to demonstrate the related properties of sublinear variance and superdiffusivity. We show that directed last-passage percolation with Gaussian vertex weights has a sublinear variance property. We also consider other vertex weight distributions. Corresponding results are obtained for the ground state of the ‘directed polymers in a ran...
متن کاملSublinear deviation between geodesics and sample paths
We give a proof of the sublinear tracking property for sample paths of random walks on various groups acting on spaces with hyperbolic-like properties. As an application, we prove sublinear tracking in Teichmüller distance for random walks on mapping class groups, and on Cayley graphs of a large class of finitely generated groups.
متن کاملOn the block-structured distance to non-surjectivity of sublinear mappings
We show that the block-structured distance to non-surjectivity of a set-valued sublinear mapping equals the reciprocal of a suitable blockstructured norm of its inverse. This gives a natural generalization of the classical Eckart and Young identity for square invertible matrices. GSIA Working Paper 2003-23 ∗Supported by NSF grant CCR-0092655.
متن کاملSublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem
Given d > 2 and a set of n grid points Q in <, we design a randomized algorithm that finds a w-wide separator, which is determined by a hyper-plane, in O(n 2 d log n) sublinear time such that Q has at most ( d d+1 + o(1))n points one either side of the hyper-plane, and at most cdwn d−1 d points within w 2 distance to the hyper-plane, where cd is a constant for fixed d. In particular, c3 = 1.209...
متن کامل